Minimal Obstructions for Partial Representations of Interval Graphs
نویسندگان
چکیده
منابع مشابه
Minimal Obstructions for Partial Representations of Interval Graphs
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solvin...
متن کاملMinimal Euclidean representations of graphs
A simple graph G is representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two vertices is one of only two distinct values a or b, with distance a if the vertices are adjacent and distance b otherwise. The Euclidean representation number of G is the smallest dimension in which G is represent...
متن کاملFully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques, and its modular decomposition. After each vertex or edge modification (insertion or deletion), the algorithm determines whether the new graph is an interval graph in O(n) time, and, in the positive, updates the three...
متن کاملBounded Representations of Interval and Proper Interval Graphs
Klav́ık et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex v two intervals Lv and Rv called bounds. We ask whether there exists a bounded representation in which each interval Iv has its left endpoint ...
متن کاملBounded, minimal, and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/5862